A BDI agent programming language with failure handling, declarative goals, and planning

Agents are an important technology that have the potential to take over contemporary methods for analysing, designing, and implementing complex software. The Belief- Desire-Intention (BDI) agent paradigm has proven to be one of the major approaches to intelligent agent systems, both in academia and in industry. Typical BDI agent-oriented programming languages rely on user-provided ''plan libraries'' to achieve goals, and online context sensitive subgoal selection and expansion. These allow for the development of systems that are extremely flexible and responsive to the environment, and as a result, well suited for complex applications with (soft) real-time reasoning and control requirements. Nonetheless, complex decision making that goes beyond, but is compatible with, run-time context-dependent plan selection is one of the most natural and important next steps within this technology. In this paper we develop a typical BDI-style agent-oriented programming language that enhances usual BDI programming style with three distinguished features: declarative goals, look-ahead planning, and failure handling. First, an account that mixes both procedural and declarative aspects of goals is necessary in order to reason about important properties of goals and to decouple plans from what these plans are meant to achieve. Second, lookahead deliberation about the effects of one choice of expansion over another is clearly desirable or even mandatory in many circumstances so as to guarantee goal achievability and to avoid undesired situations. Finally, a failure handling mechanism, suitably integrated with both declarative goals and planning, is required in order to model an adequate level of commitment to goals, as well as to be consistent with most real BDI implemented systems

Extending BDI plan selection to incorporate learning from experience

An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI execution framework that models context conditions as decision trees, rather than boolean formulae, allowing agents to learn the probability of success for plans based on experience. By using a probabilistic plan selection function, the agents can balance exploration and exploitation of their plans. We extend earlier work to include both parameterised goals and recursion and modify our previous approach to decision tree confidence to include large and even non-finite domains that arise from such consideration. Our evaluation on a pre-existing program that relies heavily on recursion and parametrised goals confirms previous results that naive learning fails in some circumstances, and demonstrates that the improved approach learns relatively well

Measuring plan coverage and overlap for agent reasoning

In Belief Desire Intention (BDI) agent systems it is usual for goals to have a number of plans that are possible ways of achieving the goal, applicable in di erent situations, usually captured by a context condition. In Agent Oriented Software Engineering it has been suggested that a designer should be conscious of whether a goal has complete coverage, that is, is there some plan that is applicable for every situation. Similarly a designer should be conscious of overlap, that is, for a given goal, are there situations where more than one plan could be applicable for achieving that goal. In this paper we further develop these notions in two ways, and then describe how they can be used both in agent reasoning and agent system development. Firstly we replace the boolean value for basic coverage and overlap with numerical measures, and explain how these may be calculated. Secondly we describe a measure that combines these basic measures, with the characteristics of the coverage/overlap in the goal-plan tree below a given goal. We then describe how these domain independent measures can be used for both plan selection and intention selection, as well as for guidance in agent system development

Hierarchical planning in BDI agent programming languages: A formal approach

This paper provides a general mechanism and a solid theoretical basis for performing planning within Belief-Desire-Intention (BDI) agents. BDI agent systems have emerged as one of the most widely used approaches to implementing intelligent behaviour in complex dynamic domains, in addition to which they have a strong theoretical background. However, these systems either do not include any built-in capacity for "lookahead" type of planning or they do it only at the implementation level without any precise defined semantics. In some situations, the ability to plan ahead is clearly desirable or even mandatory for ensuring success. Also, a precise definition of how planning can be integrated into a BDI system is highly desirable. By building on the underlying similarities between BDI systems and Hierarchical Task Network (HTN) planners, we present a formal semantics for a BDI agent programming language which cleanly incorporates HTN-style planning as a built-in feature. We argue that the resulting integrated agent programming language combines the advantages of both BDI agent systems and hierarchical offline planners

Molecular characterization of the Sicilian goat populations

The Sicilian goats are characterized by a strong population admixture structure, caused by geographical location of the farms, influences of natural mating and traditional breeding systems where flock represents an important breeding unit. Nowadays, several local populations are reared in Sicily, some of which do not have a recognized defined genetic structure, having taken origin from several crosses between animals of different breeds/populations sharing the same environment. The aim of this work was to characterize the Sicilian autochthonous goat populations using microsatellite markers and genetic polymorphisms of casein gene

Supervisory Control for Behavior Composition

We relate behavior composition, a synthesis task studied in AI, to supervisory control theory from the discrete event systems field. In particular, we show that realizing (i.e., implementing) a target behavior (e.g., a house surveillance system) by suitably coordinating a collection of available behaviors (e.g., doors, lights, cameras, etc.) amounts to imposing a supervisor onto a special discrete event system. Such a link allows us to leverage on the solid foundations and extensive work on discrete event systems, including borrowing tools and ideas from it

First principles planning in BDI systems

BDI (Belief, Desire, Intention) agent systems are very powerful, but they lack the ability to incorporate planning. There has been some previous work to incorporate planning within such systems. However, this has either focussed on producing low-level plan sequences, losing much of the domain knowledge inherent in BDI systems, or has been limited to HTN (Hierarchical Task Network) planning, which cannot find plans other than those specified by the programmer. In this work, we incorporate classical planning into a BDI agent, but in a way that respects and makes use of the procedural domain knowledge available, by producing abstract plans that can be executed using such knowledge. In doing so, we recognize an intrinsic tension between striving for abstract plans and, at the same time, ensuring that unnecessary actions, unrelated to the specific goal to be achieved, are avoided. We explore this tension, by first characterizing the set of 'ideal' abstract plans that are non-redundant while maximally abstract, and then developing a more limited but feasible account in which an abstract plan is 'specialized' into a new abstract plan that is non-redundant and preserves abstraction as much as possible. We describe an algorithm to compute such a plan specialization, as well as algorithms for the production of a valid high level plan, by deriving abstract planning operators from the BDI program

Revising conflicting intention sets in BDI agents

Autonomous agents typically have several goals they are pursuing simultaneously. Even if the goals themselves are not necessarily inconsistent, choices made about how to pursue each of these goals may well result in a set of intentions which are conflicting. A rational autonomous agent should be able to reason about and modify its set of intentions to take account of such issues. This paper presents the semantics of some preferences regarding modified sets of intentions. We look at the possibility of simply deleting some intention(s) but more importantly we also look at the possibility of modifying intentions, such that the goals will still be achieved but in a different way